NCSS: an effective and efficient complex network community detection algorithm
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Community Detection in Complex Networks
Community structure detection in complex networks attracts considerable attention in recent years. In this paper we propose an algorithm to detect community structures in very large networks. Basing on the local community detection, this algorithm is able to detect global community structures. We found that the local maximal degree nodes locate dispersedly in networks and can be considered as k...
متن کاملAn Efficient Multi-objective Community Detection Algorithm in Complex Networks
Original scientific paper Community detection in complex networks is often regarded as the problem of single-objective optimization and it is hard for single-objective optimization to identify potential community structure of meaningfulness. Thus, algorithm of multi-objective optimization is applied to the field of community detection. However, multi-objective community detection algorithm is p...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملCommunity Detection in Complex Network via BGLL Algorithm
A large number of networks in nature, society and technology are defined by a mesoscopic level of organization, in which groups of nodes form tightly connected units, called communities, that are sparsely inter-linked to each other . Identifying this community structure is one of the most important problems in understanding of functions and structures of real world complex systems, which is sti...
متن کاملan efficient extension of network simplex algorithm
in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Informationis
سال: 2016
ISSN: 1674-7267
DOI: 10.1360/n112015-00026